منابع مشابه
Inventory Model for Deteriorating Items with Four level System and Shortages
This paper presents an inventory model for deteriorating items in which shortages are allowed. It is assumed that the production rate is proportional to the demand rate and greater than demand rate. The inventory model is developed by considering four different circumstances. The optimal of the problem is obtained with the help of Mathematica 7 software. Numerical examples are given to illustra...
متن کاملPredecessor problem on smooth distributions
We follow a research thread studying the predecessor problem on “smooth” distribution families. We propose a conceptually simpler solution utilizing wellknown results from much better studied variant of the problem that assumes nothing about the input. As a side effect, we are able to extend the range of handled input distributions for the most studied case needing expected O (log log n) time, ...
متن کاملSolving Games without Controllable Predecessor
Two-player games are a useful formalism for the synthesis of reactive systems. The traditional approach to solving such games iteratively computes the set of winning states for one of the players. This requires keeping track of all discovered winning states and can lead to space explosion even when using efficient symbolic representations. We propose a new method for solving reachability games....
متن کاملproficiency level and factors fostering reticence in efl learners
according to cheng (1999), in recent esl/efl literature, asian (especially east asian) learners of english as a foreign/second language have been arguably reported as reticent and passive learners. the most common allegations are that these students are reluctant to participate in classroom discourse; they are unwilling to give responses; they do not ask questions; and they are passive and over...
15 صفحه اولRange Predecessor and Lempel-Ziv Parsing
The Lempel-Ziv parsing of a string (LZ77 for short) is one of the most important and widely-used algorithmic tools in data compression and string processing. We show that the LempelZiv parsing of a string of length n on an alphabet of size σ can be computed in O(n log log σ) time (O(n) time if we allow randomization) using O(n log σ) bits of working space; that is, using space proportional to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in Educational Evaluation
سال: 2003
ISSN: 0191-491X
DOI: 10.1016/s0191-491x(03)90009-5